Lagrangian relaxation algorithm for the truck scheduling problem with products time window constraint in multi-door cross-dock

<p style='text-indent:20px;'>Cross-docking is a kind of process that products are unloaded in front the inbound doors, consolidated based on downstream demand, and then directly transferred to outbound doors without long storage during transportation. In this paper, multi-door cross-dock truck scheduling problem investigated which sequencing assignment trucks need be considered, with objectives minimizing inner transportation cost total waiting cost. The major contribution paper novel product-related time window constraint temporary area firstly introduced adapt different physical conditions goods considering real-world requirements. Then, Lagrangian relaxation algorithm proposed aims decompose relaxed into several easy-to-be-solved sub-problems. Besides, subgradient used at each iteration further deal these Finally, theory analysis simulation experiments scales carried out comparison Greedy evaluate performance algorithm. Results indicate able achieve more satisfactory near-optimal solutions within an acceptable time.</p>